منابع مشابه
Groups with no coarse embeddings into hyperbolic groups
We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is “admitting exponentially many fat bigons”, and it is preserved by a coarse embedding between graphs with bounded degree. Groups with exponential growth and linear divergence (such as direct...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملEmbeddings into Thompson's group V and coCF groups
Lehnert and Schweitzer show in [21] that R. Thompson’s group V is a co-context-free (coCF ) group, thus implying that all of its finitely generated subgroups are also coCF groups. Also, Lehnert shows in his thesis that V embeds inside the coCF group QAut(T2,c), which is a group of particular bijections on the vertices of an infinite binary 2-edge-colored tree, and he conjectures that QAut(T2,c)...
متن کاملAsymptotic isoperimetry on groups and uniform embeddings into Banach spaces
We characterize the asymptotic behaviour of the compression associated to a uniform embedding into some Lp-space for a large class of groups including connected Lie groups with exponential growth and wordhyperbolic finitely generated groups. This also provides new and optimal estimates for the compression of a uniform embedding of the infinite 3regular tree into some Lp-space. The main part of ...
متن کاملOn Efficient Embeddings of Grids into Grids in PARIX
A hardware independent method of programming a massively parallel machine (MPP) can best be supported by a well-designed run-time environment. An important problem in this design is the ability of e ciently simulating networks di erent from the hardware topology. We will describe the mapping kernel of the virtual processors library for the commercial run-time system PARIX. This kernel contains ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1997
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500023750